Verification Condition Splitting
نویسندگان
چکیده
In a traditional approach to program verification, the correctness of each procedure of a given program is encoded as a logical formula called the verification condition. It is then up to a theorem prover, like an automatic SMT solver, to analyze the verification condition in the attempt to either establish the validity of the formula (thus proving the correct correct) or find counterexamples (thus revealing errors in the program). This paper presents a technique that, via programstructure-aware transformations that split one verification condition up into several, lead to better overall performance of the SMT solver, sometimes making it up to several orders of magnitude faster. The technique also lends itself to improved error messages in case of verification failure due to time-outs.
منابع مشابه
A High-Order Eulerian Godunov Methodfor Elastic–Plastic Flow in Solids
We present an explicit second-order-accurate Godunov finite difference method for the solution of the equations of solid mechanics in one, two, and three spatial dimensions. The solid mechanics equations are solved in nonconservation form, with the novel application of a diffusion-like correction to enforce the gauge condition that the deformation tensor be the gradient of a vector. Physically ...
متن کاملIdempotents in intensional type theory
We study idempotents in intensional Martin-Löf type theory, and in particular the question of when and whether they split. We show that in the presence of propositional truncation and Voevodsky’s univalence axiom, there exist idempotents that do not split; thus in plain MLTT not all idempotents can be proven to split. On the other hand, assuming only function extensionality, an idempotent can b...
متن کاملHandlebody-preserving Finite Group Actions on Haken Manifolds with Heegaard Genus Two
Let M be a closed orientable 3-manifold of Heegaard genus two with a non-trivial JSJ-decomposition and G be a finite group of orientation-preserving smooth actions on M which preserves each handlebody of Heegaard splitting and each piece of the JSJ-decomposition of M . We will call some specific conditions of the Heegaard splitting and the JSJ-tori the condition A, . . . , and the condition F. ...
متن کاملConvex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification
We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer transformed clauses, and refinement by splitting predicates. The purpose of the work is to investigate how analysis and transformation tools developed fo...
متن کاملNew Type of Matrix Splitting and Its Applications
One possible type of the matrix splitting is introduced. Using this matrix splitting, we introduce a few properties and representations of generalized inverses as well as iterative methods for computing various solutions of singular linear systems. This matrix splitting is a generalization of the known index splitting from [13] and a proper splitting from [4]. Using a generalization of the cond...
متن کامل